IP LOOKUP BY BINARY SEARCH ON PREFIX LENGTH

IP Lookup By Binary Search On Prefix Length

A New Efficient IP Address Lookup Based on Binary Search

IP address lookup is an important function in a router to settle overall performance of the router. Binary search on range is a useful algorithm based on binary search for IP address lookup. However, this approach requires a lot of memories for adapting binary search to variable-length prefixes. We propose the improved algorithm to reduce memory requirements than binary search on range dramatic...

An Efficient IP Address Lookup Scheme Using Balanced Binary Search with Minimal Entry and Optimal Prefix Vector

Although IP address lookup schemes using ternary content addressable memory (TCAM) can perform high speed packet forwarding, TCAM is much more expensive than ordinary memory in implementation cost. As a low-cost solution, binary search algorithms such as a binary trie or a binary search tree have been widely studied. This paper proposes an efficient IP address lookup scheme using balanced binar...

IP Lookup Using the Novel Idea of Scalar Prefix Search with Fast Table Updates

Recently, we have proposed a new prefix lookup algorithm which would use the prefixes as scalar numbers. This algorithm could be applied to different tree structures such as Binary Search Tree and some other balanced trees like RB-tree, AVL-tree and B-tree with minor modifications in the search, insert and/or delete procedures to make them capable of finding the prefixes of an incoming string e...

A New Efficient Binary Search on Range for IP Address Lookup

IP address lookup is an important function to meet such requirements as high speed, memory size and low power for the overall performance of the routers. The biggest problem of IP address lookup is that prefixes has a variable length so that longest prefix match should be employed for IP address lookup. Binary search is useful to decrease search times. But binary search is only adaptable to an ...